Measurement aggregation and routing techniques for energy%2Defficient estimation in wireless sensor networks.

Quality Assessment Approaches in Data Mining.

Quality Classifiers for Open Source Software Repositories.
Abstract Open Source Software (OSS) often relies on large repositories, like SourceForge, for initial incubation. The OSS repositories offer a large variety of meta-data providing interesting information about projects and their success. In this paper we propose a data mining approach for training classifiers on the OSS metadata provided by such data repositories. The classifiers learn to predict the successful continuation of an OSS project. The ‘successfulness ’ of projects is defined in terms of the classifier confidence with which it predicts that they could be ported in popular OSS projects (such as FreeBSD, Gentoo Portage). 1
Lifetime Maximization in Wireless Sensor Networks with an Estimation Mission.

Hierarchial Clustering.
Analysis-oriented database applications, such as data  warehousing or customer relationship management, play a crucial  role in the database area. In general, the multidimensional data  model is used in these applications, realized as star or snow-flake  schemata in the relational world. The so-called star queries are the  prevalent type of queries on such schemata. All database vendors  have extended their products to support star queries efficiently.
Quality Classifiers for Open Source Software Repositories
Abstract Open Source Software (OSS) often relies on large repositories, like SourceForge, for initial incubation. The OSS repositories offer a large variety of meta-data providing interesting information about projects and their success. In this paper we propose a data mining approach for training classifiers on the OSS metadata provided by such data repositories. The classifiers learn to predict the successful continuation of an OSS project. The ‘successfulness ’ of projects is defined in terms of the classifier confidence with which it predicts that they could be ported in popular OSS projects (such as FreeBSD, Gentoo Portage). 1
NPClu An approach for clustering spatially extended objects.

A density%2Dbased cluster validity approach using multi%2Drepresentatives.

A clustering framework based on subjective and objective validity criteria.

Efficient Online State Tracking Using Sensor Networks.
Sensor networks are being deployed for tracking events of interest in many environmental or monitoring applications. Because of their distributed nature of operation, a challenging issue is how to accurately identify the aggregate state of the phenomenon that is being observed. This work presents an online mechanism for efficiently determining the overall network status, employing distributed operations that minimize the communication costs. Experiments on real data, suggest that the proposed metholology can be a viable solution for real world systems. 1.
Resilient and energy efficient tracking in sensor networks.

Quality Assessment Approaches in Data Mining.

A Framework for Semi%2DSupervised Learning Based on Subjective and Objective Clustering Criteria.

Quality Assessment Approaches in Data Mining.

THESUS%2C a Closer View on Web Content Management Enhanced with Link Semantics.
“The greatest help we can give others is not to share our riches with them, but to discover theirs.” Louis Lavelle, L’Erreur de Narcisse, 1939 With the unstoppable growth of the WWW, the great success of Web Search Engines, such as Google and Alta-vista, users now turn to the Web whenever looking for information. However, many users are neophytes when it comes to computer science, yet they are often specialists of a certain domain. These users would like to add more semantics to guide their search through WWW material, whereas currently most search features are based on raw lexical content. We show in this article how the use of the incoming links of a page can be used efficiently to classify a page in a concise manner. This enhances the browsing and querying of web pages. In this article, we focus on the tools needed in order to manage the links, and their semantics. We further process these links using a hierarchy of concepts, akin to an ontology, and a thesaurus. This work is demonstrated by an prototype system, called THESUS, that organizes thematic web documents into semantic clusters. Our contributions in this article are the following: 1- a model and language to exploit link semantics information, 2- the THESUS prototype system, 3- its innovative aspects and algorithms, more specifically the novel similarity measure, between web documents applied to different clustering schemes (DB-Scan and COBWEB), 4- a thorough experimental evaluation proving the value of our approach.
Uncertainty Handling and Quality Assessment in Data Mining

Towards a Logical Model for Patterns.



UMiner A Data Mining System Handling Uncertainty and Quality.

Managing Uncertainty and Quality in the Classification Process.
An important open issue in KDD research is the reveal and the handling of uncertainty. The popular classification approaches do not take into account this feature while they do not exploit properly the significant amount of informarion included in the results of classification process (i.e., classification scheme), though it will be useful in decision-making. In this paper we present a framework that maintains uncertainty throughout the classification process by maintaining the classification belief and moreover enables assignment of an item to mulriple classes with a different belief. Decision support tools are provided for decisions related to: i. relative importance of classes in a dam set (i.e., &#034;young vs. old customers&#034;), ii. relative importance of classes across data sets iii. the informarion content of different dam sets. Finally we provide a mechanism for evaluaring classification schemes and select the scheme that best fits the data under consideration.
Cluster Validity Methods Part I.
Clustering is an unsupervised process since there are no predefined classes and no examples that would indicate grouping properties in the data set. The majority of the clustering algorithms behave differently depending on the features of the data set and the initial assumptions for defining groups. Therefore, in most applications the resulting clustering scheme requires some sort of evaluation as regards its validity. Evaluating and assessing the results of a clustering algorithm is the main subject of cluster validity.
Clustering Validity Checking Methods Part II.
Clustering restfits validation is an important topic in the context of pattern recognition. We review approaches and systems in this context. In the first part of this paper we presented clustering validity checking approaches based on internal and external criteria. In the second, current part, we present a review of clustering validity approaches based on relative criteria. Also we discuss the restfits of an experimental study based on widely known validity indices. Finally the paper illustrates the issues that are under-addressed by the recent approaches and proposes the research directions in the field.
Clustering Validity Assessment Finding the Optimal Partitioning of a Data Set.
Clustering is a mostly unsupervised procedure and the majority of the clustering algorithms depend on certain assumptions in order to define the subgroups present in a data set. As a consequence, in most applications the resulting clustering scheme requires some sort of evaluation as regards its validity.
Clustering Validity Assessment Finding the Optimal Partitioning of a Data Set.
Clustering is a mostly unsupervised procedure and the majority of the clustering algorithms depend on certain assumptions in order to define the subgroups present in a data set. As a consequence, in most applications the resulting clustering scheme requires some sort of evaluation as regards its validity.
A Data Set Oriented Approach for Clustering Algorithm Selection.
In the last years the availability of huge transactional and experimental data sets and the  arising requirements for data mining created needs for clustering algorithms that scale and can be  applied in diverse domains. Thus, a variety of algorithms have been proposed which have  application in different fields and may result in different partitioning of a data set, depending on  the specific clustering criterion used. Moreover, since clustering is an unsupervised process, most  of the algorithms are based on assumptions in order to define a partitioning of a data set. It is then  obvious that in most applications the final clustering scheme requires some sort of evaluation.
Clustering Algorithms and Validity Measures.

On Clustering Validation Techniques.
Cluster analysis aims at identifying groups of similar objects and, therefore helps to discover distribution of patterns and interesting correlations in large data sets. It has been subject of wide research since it arises in many application domains in engineering, business and social sciences. Especially, in the last years the availability of huge transactional and experimental data sets and the arising requirements for data mining created needs for clustering algorithms that scale and can be applied in diverse domains.
Quality Assessment and Uncertainty Handling in Data Mining Process.
The KDD process aims at the discovery and extraction of &#034;useful&#034; knowledge (such as interesting patterns, classification, rules etc) from large data repositories. A widely recognized requirement is that the patterns discovered must be valid and ultimately comprehensible (i.e., to be easily understood by analysts). Another requirement that is under-addressed in KDD process is the reveal and the handling of uncertainty in the main data mining processes of clustering, classification and association rules extraction.
Quality Scheme Assessment in the Clustering Process.

